XPathMark: An XPath Benchmark for the XMark Generated Data
نویسنده
چکیده
We propose XPathMark, an XPath benchmark on top of the XMark generated data. It consists of a set of queries which covers the main aspects of the language XPath 1.0. These queries have been designed for XML documents generated under XMark, a popular benchmark for XML data management. We suggest a methodology to evaluate the XPathMark on a given XML engine and, by way of example, we evaluate two popular XML engines using the proposed benchmark.
منابع مشابه
XPathMark An XPath benchmark for XMark
We propose XPathMark, an XPath benchmark for XMark. It consists of a set of queries which covers the main aspects of the language XPath 1.0. These queries have been designed for XML documents generated under XMark, a popular benchmark for XML data management. We suggest a methodology to evaluate the XPath benchmark on a given XML engine and, by way of example, we evaluate two popular XML engine...
متن کاملXPathMark: Functional and Performance Tests for XPath
We present a major revision of the XPath benchmark known as XPathMark [1]. The new version splits into a functional test over a small educational document and a more elaborated performance test over XMark [2] documents. We conclude by sharing with the reader our experience on running XPathMark on some popular XSLT/XQuery processors. 1 Functional and Performance Tests for XPath The new release o...
متن کاملPushing XPath Accelerator to its Limits
Two competing encoding concepts are known to scale well with growing amounts of XML data: XPath Accelerator encoding implemented by MonetDB for in-memory documents and X-Hive’s Persistent DOM for on-disk storage. We identified two ways to improve XPath Accelerator and present prototypes for the respective techniques: BaseX boosts inmemory performance with optimized data and value index structur...
متن کاملEarly Nested Word Automata for XPath Query Answering on XML Streams
Algorithms for answering XPath queries on Xml streams have been studied intensively in the last decade. Nevertheless, there still exists no solution with high efficiency and large coverage. In this paper, we introduce early nested word automata in order to approximate earliest query answering algorithms for nested word automata in a highly efficient manner. We show that this approximation can b...
متن کاملScalable XML Query Processing using Parallel Pushdown Transducers
In online social networking, network monitoring and financial applications, there is a need to query high rate streams of XML data, but methods for executing individual XPath queries on streaming XML data have not kept pace with multicore CPUs. For data-parallel processing, a single XML stream is typically split into well-formed fragments, which are then processed independently. Such an approac...
متن کامل